bin packing meaning in Chinese
装箱问题
Examples
- On - line algorithms for the constrained bin packing problem
一类带约束的装箱问题的在线算法 - The bin packing problem belongs to the most complicated calculated problem : npc problem ( nondeterminstic polynomial complete )
装箱问题是具有最高计算复杂性的一类问题： npc ( nondeterministicpolynomialcomplete非确定型多项式算法)类问题。 - A variation of one - dimensional bin packing problem : the minimum cardinality bin covering problem is described and it is a huristic algorithm is designed
摘要文章介绍一维装箱问题的一个衍生问题：最小基数箱子覆盖问题和它的一个启发式算法。 - In this paper , we study an on - line version of the two - dimensional bin packing problem that is the problem of packing a list of rectangular items into a minimum number of unit - square bins in an on - line manner . an on - line algorithm called rtdh ( refined two dimensional harmonic ) is proposed and analyzed . we show that rtdh can achieve an asymptotic worst - case ratio of less than 2 . 7687 , which beats the best - known bound 2 . 85958
目前，对该问题的研究有各种算法，主要有harmonic和round算法，本文针对harmonic和round算法存在的问题，提出一种算法rtdh ( refinedtwodimensionalharmonic ) ，做了相应的分析，并且给出了该算法的最坏性能比是2 . 7687的证明，这个结果刷新了目前最好的结果2 . 85958 。 - In chapter 3 we construct two approximation algorithms which applying bin packing algorithms for scheduling problems , one is ff ( first fit ) algorithm used in parallel machine scheduling problem pm / / dj = d / n which has a lower bound of asymptotic worst - case performance ratio , another problem is scheduling independent parallel tasks in parallel identical machine systems to minimize the makespan , we use strip packing method for it and give an approximation algorithm with asymptotic performance ratio no more than 1 . 6
第一个算法利用装箱问题中的ff ( firstfit )算法求解极大化按期完工工件数的平行机排序问题pm d _ j = d n - u _ j ，该近似算法具有渐近性能比下界。第二个近似算法利用二维装箱中strippacking问题的算法求解以极小化makespan为目标的带并行工件的平行机排序问题，该算法的渐近性能比具有下界1 . 5和上界1 . 6 。